Multi-Trip Vehicle Routing Problem with Time Windows and Resource Synchronization on Heterogeneous Facilities
نویسندگان
چکیده
Inspired by long-distance road transport in industrial logistics China, this paper studies a simultaneous loading scheduling and vehicle routing problem over multi-workday planning horizon. Industrial cargo often requires specialized facilities, these facilities vary performance quantity are subject to available time constraints. Consequently, achieving coordinated optimization of becomes significant challenge practice. We describe the studied as multi-trip with windows resource synchronization on heterogeneous facilities. First, we develop mixed integer programming model setting minimize total travel distance number vehicles. Moreover, three-phase heuristic approach is developed. An initial solution constructed using sequential strategy first phase, then an adaptive large neighbourhood search post-optimization procedure based ejection chains are, respectively, designed optimize two hierarchical objective functions. Finally, extensive computational experiments conducted demonstrate effectiveness proposed method. Specifically, research results indicate that scenarios, expanding horizon from single workday period could significantly reduce operational costs improve service quality.
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملA tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows
We propose a tabu search meta-heuristic for the Time dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows. Two types of neighborhoods, corresponding to two decision sets of the problem, together with a strategy controlling the selection of the neighborhood type for particular phases of the search, provide the means to set up and combine exploration and exploitation capabili...
متن کاملA study on multi-trip vehicle routing problem with time windows and meal break considerations
متن کامل
A multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملThe Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates
The Multi Trip Vehicle Routing Problem with Time Windows and Release Dates is a variant of the Multi Trip Vehicle Routing Problem where a time windows is associated with each customer and a release date is associated with each merchandise to be delivered at a certain client. The release date represents the moment the merchandise becomes available at the depot for final delivery. The problem is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems
سال: 2023
ISSN: ['2079-8954']
DOI: https://doi.org/10.3390/systems11080412